GENET and Tabu Search for Combinatorial Optimization Problems
نویسنده
چکیده
Constraint satisfaction problems are combinatorial optimization problems which involve finding an assignment to a set of variables that is consistent with a set of constraints. In this paper the use of two local search techniques, namely GENET and Tabu Search for constraint satisfaction optimization problems and partial constraint satisfaction problems is investigated. These methods are compared by application to a difficult partial constraint satisfaction optimization problem, namely the Radio Links Frequency Assignment Problem (RLFAP).
منابع مشابه
An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملDeveloping a Permutation Method Using Tabu Search Algorithm: A Case Study of Ranking Some Countries of West Asia and North Africa Based on Important Development Criteria
The recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. One of these methods is the ‘permutation method’ which has a strong logic in connection with ranking issues, but when the number of alternatives increases, solving problems through th...
متن کاملTabu Search With Target Analysis To The Assembly Line Balancing Problems -- An Artificial Intelligence Approach
This paper describes the application of tabu search, a recent heuristic technique for combinatorial optimization problems, to the assembly line balancing problems. Computational experiments with different search strategies have been performed for some assembly ine problems from literature. Computational results show that except for few cases tabu search always finds optimal solutions.
متن کامل